More forcing notions imply diamond
نویسندگان
چکیده
We prove that the Sacks forcing collapses the continuum onto d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses ω2 then it forces ♦ω1 . Research partially supported by KBN 654/2/91 Research partially supported by “Basic Research Foundation” administered by The Israel Academy of Sciences and Humanities. Publication 475.
منابع مشابه
1 5 A ug 1 99 4 More forcing notions imply diamond
We prove that the Sacks forcing collapses the continuum onto d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses ω2 then it forces ♦ω1. Research partially supported by KBN 654/2/91 Research partially supported by “Basic Research Foundation” administered by The Israel Academy of Sciences and Humanities. Publication 475.
متن کاملIteration of λ-complete forcing notions not collapsing λ
We look for a parallel to the notion of " proper forcing " among λ-complete forcing notions not collapsing λ +. We suggest such a definition and prove that it is preserved by suitable iterations. This work follows [Sh 587] and [Sh 667] (and see history there), but we do not rely on those papers. Our goal in this and the previous papers is to develop a theory parallel to " properness in CS itera...
متن کاملHow much sweetness is there in the universe?
We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such. One of the main ingredients of the construction of the model for all projective sets of reals h...
متن کاملOn Iterated Forcing for Successors of Regular Cardinals
We investigate the problem of when ≤ λ–support iterations of < λ–complete notions of forcing preserve λ. We isolate a property — properness over diamonds — that implies λ is preserved and show that this property is preserved by λ–support iterations. Our condition is a relative of that presented in [1]; it is not clear if the two conditions are equivalent. We close with an application of our tec...
متن کاملOn Subcomplete Forcing
On Subcomplete Forcing by Kaethe Lynn Bruesselbach Minden Adviser: Professor Gunter Fuchs I survey an array of topics in set theory and their interaction with, or in the context of, a novel class of forcing notions: subcomplete forcing. Subcomplete forcing notions satisfy some desirable qualities; for example they don’t add any new reals to the model, and they admit an iteration theorem. While ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 35 شماره
صفحات -
تاریخ انتشار 1996